Asymptotic Results for the Superposition of a Large Number of Data Connections on an Atm Link Alain Dupuis, Fabrice Guillemin and Bruno Sericola
نویسندگان
چکیده
The M=PH=1 system is introduced in this paper to analyze the superposition of a large number of data connections on an ATM link. In this model, information is transmitted in bursts of data arriving at the link as a Poisson process of rate and burst durations are PH distributed with unit mean. Explicit methods of computing the distributions of some transient characteristics related to excursions by the occupation process f t g of the M=PH=1 queue above the link transmission capacity C are described. Given that such an excursion represents a congestion period for the system, the transient characteristics considered are the duration of a congestion period, the area V swept under process f t g above C in such a congestion period (V represents the volume of information lost in an overrow period), and the number N of bursts arriving in a congestion period. It is then shown that, as conjectured in earlier studies, the random variables C, CV , and N converge in distribution, as C tends to innnity while the utilization factor of the link deened by = =C is xed, towards the duration of the busy period of an M=M=1 queue with input rate and unit service rate, the area V swept under the occupation process of this M=M=1 queue in a busy period, and the number N of customers served in a busy period, respectively. Further simulation results show that after adjustment of the load of the M=M=1 queue, a similar convergence result holds for the superposition of a large number of On/OO sources with deterministic, exponential, and hyperexponential On and OO period distributions. R esultats asymptotiques pour la superposition d'un grand nombre de connexions de donn ees sur un lien ATM R esum e : La le M=PH=1 est introduite dans cet article pour analyser la superposition d'un grand nombre de connexions de donn ees sur un lien ATM. Dans ce mod ele, l'information est transmise en rafales de donn ees arrivant au lien comme un processus de Poisson de taux et les dur ees des rafales sont distribu ees selon une loi PH de moyenne 1. On d ecrit des m ethodes explicites de calcul des distributions de certaines caract eristiques transitoires en relation avec les excursions du processus d'occupation f t g de la le M=PH=1 au dessus de la capacit e C du lien de transmission. Etant donn e qu'une telle …
منابع مشابه
Asymptotic Results for the Superposition of a Large Number of Data Connections on an ATM Link
The M=PH=1 system is introduced in this paper to analyze the superposition of a large number of data connections on an ATM link. In this model, information is transmitted in bursts of data arriving at the link as a Poisson process of rate and burst durations are PH distributed with unit mean. Some transient characteristics of theM=PH=1 system, namely the duration of an excursion by the occupati...
متن کاملSimulation-based results of weighted fair queuing algorithms for ATM networks
The behavior of the ideal General Processor Sharing (gps) discipline and di erent per-VC queuing algorithms approximating this ideal scheme, namely the Self Clocked Fair Queuing, the Packet by packet Generalized Processor Sharing, and the Virtual Starting Time disciplines, are studied in this paper via simulation. We speci cally consider a simple simulation con guration involving two Constant B...
متن کاملA Basic Requirement for the Policing Function in ATM Networks
Since ATM networks will have to cope with a wide range of applications, some of them producing highly variable tra c, congestion control plays a crucial role for such networks. In this context, the policing function has been introduced to monitor the relevant tra c characteristics of any connection, and several policing mechanisms have been proposed in the literature. They will be called pick-u...
متن کاملOn the Fluid Queue Driven by an Ergodic Birth and Death Process
Fluid models are powerful tools for evaluating the performance of packet telecommunication networks. By masking the complexity of discrete packet based systems, fluid models are in general easier to analyze and yield simple dimensioning formulas. Among fluid queuing systems, those with arrival rates modulated by Markov chains are very efficient to capture the burst structure of packet arrivals,...
متن کاملTransient Characteristics of an M=m=1 System Applied to Statistical Multiplexing on an Atm Link
The Quality of Service (QoS) ooered to telecommunication applications is related to the transient behavior of network elements in the case of congestion. In this paper, we analyze the variations of the bit rate process f t g created on an ATM link transmitting data bursts in an open-loop statistical multiplexing scheme. This process is modeled by means of an M=M=1 queuing system. The performanc...
متن کامل